Some Recursive Constructions for Perfect Hash Families
نویسنده
چکیده
An (n; m; w)-perfect hash family is a set of functions F such that there exists at least one f 2 F such that fj X is one-to-one. Perfect hash families have been extensively studied by computer scientists for over 15 years, mainly from the point of view of constructing eecient algorithms. In this paper, we study perfect hash families from a com-binatorial viewpoint, and describe some new recursive constructions for these objects.
منابع مشابه
New Constructions for Perfect Hash Families andRelated Structures using Combinatorial
In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...
متن کاملExplicit constructions for perfect hash families
Let k, v, t be integers such that k ≥ v ≥ t ≥ 2. A perfect hash family PHF(N ; k, v, t) can be defined as an N × k array with entries from a set of v symbols such that every N× t subarray contains at least one row having distinct symbols. Perfect hash families have been studied by over 20 years and they find a wide range of applications in computer sciences and in cryptography. In this paper we...
متن کاملSeparating hash families: A Johnson-type bound and new constructions
Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory, we solve several open problems and conjectures concerning bounds and constructions for separating hash families. Firstly, we discover that the cardinality of ...
متن کاملImproved bounds for separating hash families
An (N ;n,m, {w1, . . . , wt})-separating hash family is a set H of N functions h : X −→ Y with |X| = n, |Y | = m, t ≥ 2 having the following property. For any pairwise disjoint subsets C1, . . . , Ct ⊆ X with |Ci| = wi, i = 1, . . . , t, there exists at least one function h ∈ H such that h(C1), h(C2), . . . , h(Ct) are pairwise disjoint. Separating hash families generalize many known combinator...
متن کاملDense Testers: Almost Linear Time and Locally Explicit Constructions
We develop a new notion called (1− ǫ)-tester for a set M of functions f : A → C. A (1− ǫ)-tester for M maps each element a ∈ A to a finite number of elements Ba = {b1, . . . , bt} ⊂ B in a smaller sub-domain B ⊂ A where for every f ∈ M if f(a) 6= 0 then f(b) 6= 0 for at least (1 − ǫ) fraction of the elements b of Ba. I.e., if f(a) 6= 0 then Prb∈Ba [f(b) 6= 0] ≥ 1− ǫ. The size of the (1− ǫ)-test...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996